On the Loop-Free Decomposition of Stochastic Finite-State Systems
نویسنده
چکیده
Two generalizations of Bacon's theory of loop-free decomposition of probabilistic finite-state systems are proposed. The first of these consists of a modification of the structure of the decomposition which then allows for the decomposition of a larger class of systems. The second generalization subsumes the first: sufficient conditions for a stochastic finite-state system to be decomposable for a single initial distribution on its set of states are given.
منابع مشابه
Optimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کاملA Robust Control Design Technique for Discrete-Time Systems
A robust state feedback design subject to placement of the closed loop eigenvalues in a prescribed region of unit circle is presented. Quantitative measures of robustness and disturbance rejection are investigated. A stochastic optimization algorithm is used to effect trade-off between the free design parameters and to accomplish all the design criteria. A numerical example is given to illustra...
متن کاملIdentification and Control of MIMO Systems with State Time Delay (Short Communication)
Time-delay identification is one of the most important parameters in designing controllers. In the cases where the number of inputs and outputs in a system are more than one, this identification is of great concern. In this paper, a novel autocorrelation-based scheme for the state variable time-delay identification for multi-input multi-output (MIMO) system has been presented. This method is ba...
متن کاملA Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases
The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...
متن کاملRobust uncapacitated multiple allocation hub location problem under demand uncertainty: minimization of cost deviations
The hub location–allocation problem under uncertainty is a real-world task arising in the areas such as public and freight transportation and telecommunication systems. In many applications, the demand is considered as inexact because of the forecasting inaccuracies or human’s unpredictability. This study addresses the robust uncapacitated multiple allocation hub location problem with a set of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Information and Control
دوره 17 شماره
صفحات -
تاریخ انتشار 1970